An Algorithm for the Proportional Division of Indivisible Items
نویسندگان
چکیده
منابع مشابه
The undercut procedure: an algorithm for the envy-free division of indivisible items
We propose a procedure for dividing indivisible items between two players in which each player ranks the items from best to worst. It ensures that each player receives a subset of items that it values more than the other player’s complementary subset, given that such an envy-free division is possible. We show that the possibility of one player’s undercutting the other’s proposal, and implementi...
متن کاملTwo-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
T he problem of fairly dividing a divisible good, such as cake or land, between two people probably goes back to the dawn of civilization. The first mention we know of in Western literature of the well-known procedure, “I cut, you choose,” occurs in the Hebrew Bible, wherein Abraham and Lot divide the land that lies before them, with Abraham obtaining Canaan and Lot obtaining Jordan (Genesis 13...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAssigning indivisible and categorized items
In this paper, we study the problem of assigning indivisible items under the following constraints: 1) each item belongs to one of the p categories, 2) each agent is required to get exactly one item from each category, 3) no free disposal, and 4) no monetary transfer. We first characterize serial dictatorships by a minimal set of 3 properties: strategy-proofness, non-bossiness, and categorywise...
متن کاملFairly Allocating Contiguous Blocks of Indivisible Items
In this paper, we study the classic problem of fairly allocating indivisible items with the extra feature that the items lie on a line. Our goal is to find a fair allocation that is contiguous, meaning that the bundle of each agent forms a contiguous block on the line. While allocations satisfying the classical fairness notions of proportionality, envyfreeness, and equitability are not guarante...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2014
ISSN: 1556-5068
DOI: 10.2139/ssrn.2447952